MIME-Version: 1.0
Server: CERN/3.0
Date: Tuesday, 07-Jan-97 14:43:32 GMT
Content-Type: text/html
Content-Length: 7283
Last-Modified: Thursday, 12-Dec-96 21:33:48 GMT

<title>Roberto Bayardo's Papers</title>

[ <!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><a href = "#journal"> Journal Articles </a> | <!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><a href = "#conference"> Conference Papers </a> | <!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><a href = "#workshop"> Refereed Workshop Papers </a> | <!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><a href = "#tech"> Technical Reports </a> ]

<hr size=3>

<h2> <a name = "journal">Journal Articles </a> </h2>

<ul>


<li> Roberto J. Bayardo Jr. and 
   <!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><a href="http://www.cs.utexas.edu/users/miranker"> Daniel P. Miranker</a>. 
     <b> An optimal
     backtrack algorithm for tree-structured constraint satisfaction
     problems.</b> <i> Artificial Intelligence</i> 71(1), 159-181, 1994.<p>

     Presents a top-down algorithm for solving tree-structured
     constraint satisfaction problems in linear time and evaluates its 
     average-case performance empirically. <br>
     <tt>(Not available on-line) </tt><p> 

</ul>

<hr size=3>

<h2> <a name = "conference">Conference Papers </a> </h2>

<ul>

<li> Roberto J. Bayardo Jr. and
   <!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><a href="http://www.cs.utexas.edu/users/miranker"> Daniel P. Miranker</a>. 
     <b> Processing Queries for First-Few Answers. </b>
     In <i> Proc. of the 
     <!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><a href="http://www.cs.umanitoba.ca/~dbgroup/cikm96/">
     Fifth Int'l Conf. on Information and Knowledge Management 
     </a>, </i> 45-52, Rockville,
     Maryland, 1996. <p>

   Describes a probabalistic method for predicting costs of first-answer query
   plans under a modified pipelined-join execution model. <br>
   <b> <!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><a href="http://www.cs.utexas.edu/users/bayardo/ps/cikm96.ps.Z"> cikm96.ps.Z</a> </b>
   <tt> (Compressed PostScript, 92k) </tt> <p>

<li> <a name = "toolkit"> Roberto J. Bayardo Jr. </a> and 
     <!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><a href="http://www.cs.utexas.edu/users/schrag"> Robert Schrag</a>.  
     <b> Using CSP look-back
     techniques to solve exceptionally hard SAT instances.</b>
     In <i> Proc. of the Second Int'l Conf. on Principles
     and Practice of Constraint Programming (Lecture Notes in Computer 
     Science 1118) </i>, 46-60, Springer, 1996.<p>

     CSP look-back techniques (CBJ, learning), not widely used in
     existing SAT algorithms, turn out to be indispensable for solving
     instances which are "exceptionally hard". A new procedure
     we define generates such instances consistently. <br> 
     <b> <!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><a href="http://www.cs.utexas.edu/users/bayardo/ps/cp96.ps.Z"> cp96.ps.Z</a> </b> 
     <tt> (Compressed PostScript, 90k)</tt>
     <br> Procedures used in this paper are 
     available in the toolkit linked below. Click 
     <!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><a href="http://www.cs.utexas.edu/users/bayardo/README.html"> here</a> for a brief description of its contents.
     <br><b> <!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><a href="http://www.cs.utexas.edu/users/bayardo/ehi_tool.tar.Z"> ehi_tool.tar.Z (v1.01)</a></b>
     <tt> (Tar'ed and compressed SPARC executables, 298k)</tt> <p>

<li> Roberto J. Bayardo Jr. and 
   <!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><a href="http://www.cs.utexas.edu/users/miranker"> Daniel P. Miranker</a>. 
     <b> A complexity analysis of space-bounded learning algorithms for the 
     constraint satisfaction problem.</b>
     In <i> Proc. of the 13th National Conf. on Artificial
     Intelligence, </i> 298-304, 1996. <p>

     Analyzes the effects of space-bounded learning 
     (a.k.a. constraint-recording) schemes on the runtime complexity of 
     backtrack search.  <br> 
     <b> <!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><a href="http://www.cs.utexas.edu/users/bayardo/ps/aaai96.ps.Z"> aaai96.ps.Z</a></b>
     <tt> (Compressed PostScript, 97k) </tt> <p>

<li> Roberto J. Bayardo Jr. and 
   <!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><a href="http://www.cs.utexas.edu/users/miranker"> Daniel P. Miranker</a>. 
     <b> On the space-time 
     trade-off in solving constraint satisfaction problems.</b>
     In <i> Proc. of the 14th Int'l Joint Conf. on 
     Artificial Intelligence,</i> 558-562, 1995.<p>

     From the perspective of achieving tractable constraint satisfaction
     by	restricting constraint graph structure, extensive use of space may
     be of limited benefit. <br> <b> <!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><a href="http://www.cs.utexas.edu/users/bayardo/ps/ijcai95.ps.Z"> ijcai95.ps.Z</a>
     </b> <tt> (Compressed PostScript, 47k) </tt> <p>

<li> J. C. Browne, A. Emerson, M. G. Gouda, 
   <!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><a href="http://www.cs.utexas.edu/users/miranker"> D. P. Miranker</a>, 
     A. Mok, R. J. 
     Bayardo Jr., S. Chodrow, D. Gadbois, F. Haddix, T. W. Hetherington, 
     L. Obermeyer, D.-C. Tsou, C.-K. Wang, and R. Wang. <b> A new
     approach to modularity in rule-based programming. </b> 
     In <i> Proc. of the Sixth Int'l Conf. on Tools
     with Artificial Intelligence, </i> 18-25, IEEE Press, 1994. <p>

     Describes a purely declarative method for introducing modularity into 
     forward-chaining rule-based languages, and its embodiment in the
     syntax of the Venus rule language. <br> 
     <b> <!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><a href="http://www.cs.utexas.edu/users/bayardo/ps/ictai94.ps.Z"> ictai94.ps.Z</a> </b>
     <tt> (Compressed PostScript, 372k) </tt> <p>

</ul>

<hr size=3>

<h2> <a name = "workshop">Refereed Workshop Papers</a> </h2>

<ul>

<li> <!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><a href="http://www.cs.utexas.edu/users/miranker"> D. P. Miranker</a>, 
     Roberto J. Bayardo Jr., and V. Samoladas. 
     <b> Query Evaluation as Constraint Search; An Overview of Early 
     Results. </b>
     In <i> Proc. of the Workshop on Constraints and Databases 
     at the Second Int'l Conf. on Principles and Practice of 
     Constraint Programming (Lecture Notes in Computer Science, 
     volume to be determined), </i> Springer, 1997.<p> 

     Overview of various results on applying constraint processing 
     techniques to query processing. <br> 
     <b> <!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><a href="http://www.cs.utexas.edu/users/bayardo/ps/cp96db_lncs.ps.Z"> cp96db_lncs.ps.Z</a> </b>
     <tt> (Compressed PostScript, 62k) </tt> <p>
</ul> 

<hr size=3>

<h2> <a name = "tech"> Technical Reports </a> </h2>

<ul>

<li> R. J. Bayardo Jr., B. Bohrer, R. Brice, A. Cichocki, J. Fowler,
     S. Helal, V. Kashyap, T. Ksiezyk, G. Martin, M. Nodine, M. Rashid,
     M. Rusinkiewicz, R. Shea, C. Unnikrishnan, A. Unruh, and D. Woelk.
     <b> Infosleuth: Semantic Integration of Information in Open and 
     Dynamic Environments. </b>
     Technical Report MCC-INSL-088-96, Microelectronics and Computer 
     Technology Corporation, 1996. <p>

     Describes agent-based architecture for integrating heterogeneous
     information bases in an ever-changing network of information 
     sources. <br>
     (PostScript available through the 
     <!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><a href="http://www.mcc.com/projects/infosleuth/"> InfoSleuth Project</a> 
     .)<p>

<li> Roberto J. Bayardo Jr..
     <b> Dealing with Duplicate Tuples in Multi-Join Query Processing. </b>
     Technical Report TR-96-11, University of Texas at Austin, 
     Dept. of Computer Sciences, May 1996. <p>

     Presents and evaluates several schemes for handling duplicate
     tuple elimination during optimization and execution of large
     select-project-join queries. <br>
     <b> <!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><a href="http://www.cs.utexas.edu/users/bayardo/ps/TR-96-11.ps.Z"> TR-96-11.ps.Z</a> </b>
     <tt> (Compressed PostScript, 67k) </tt> <p>

<li> Roberto J. Bayardo Jr..
     <b> Enhancing Query Plans for Many-Way Joins. </b>
     Technical Report TR-95-09, University of Texas at Austin, 
     Dept. of Computer Sciences, March 1995. <p>

     Proposes a method for annotating query plans with additional operators
     in order to efficiently produce the query result in the form of a
     directionally reduced acyclic database.  <br> 
     <b> <!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><a href="http://www.cs.utexas.edu/users/bayardo/ps/TR-95-09.ps.Z"> TR-95-09.ps.Z</a> </b>
     <tt> (Compressed PostScript, 72k) </tt> <p>
</ul>

<hr size=3>

<!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><img src="http://www.cs.utexas.edu/pub/cgi/Count.cgi?ft=3&dd=B&frgb=0;0;255|df=bayardo2.dat" align=absmiddle>

Back to <!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><a href="http://www.cs.utexas.edu/users/bayardo/index.html"> my home page</a>.

